Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem
نویسندگان
چکیده
منابع مشابه
Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem
This paper discusses the comparison of two different heuristics for total covering problem. The total covering problem is a facility location problem in which the objective is to identify the minimum number of sites among the potential sites to locate facilities to cover all the customers. This problem is a combinatorial problem. Hence, heuristic development to provide solution for such problem...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملheuristic and exact algorithms for generalized bin covering problem
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملa meta-heuristic approach to cvrp problem: local search optimization based on ga and ant colony
the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: iBusiness
سال: 2010
ISSN: 2150-4075,2150-4083
DOI: 10.4236/ib.2010.22019